Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions
نویسندگان
چکیده
منابع مشابه
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions
In this paper, we address a fundamental problem related to the induction of Boolean logic: Given a set of data, represented as a set of binary “true n-vectors” (or “positive examples”) and a set of “false n-vectors” (or “negative examples”), we establish a Boolean function (or an extension) f , so that f is true (resp., false) in every given true (resp., false) vector. We shall further require ...
متن کاملBest-fit Interval Extensions of Partially Defined Boolean Functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their value is true, if and only if the input data viewed as an n-bit integer belongs to the interval [a, b] corresponding to the function concerned. In this paper we show, that the problem of finding an interval function, w...
متن کاملRenamable Interval Extensions of Partially Defined Boolean Functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. The value of an n-variable interval function specified by interval [a, b] (where a and b are n-bit binary numbers) is true if and only if the input vector viewed as an n-bit number belongs to the interval [a, b]. Renamable i...
متن کاملFully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes.
متن کاملOn Functions Defined on Free Boolean Algebras
We characterize measures on free Boolean algebras and we examine the relationships that exists between measures and binary tables in relational databases. It is shown that these measures are completely defined by their values on positive conjunctions and an algorithm that leads to the construction of measures starting from its values on positive conjunction is also given, including a formula th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1998
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2687